Lecture 9: Message Authentication Code
نویسنده
چکیده
In this lecture, we will study message authentication. This lecture is organized as follows. • First we will review the cryptographic algorithms that we have learned so far, and discuss their limitations in protecting data integrity and supporting message authentication. • Then we will examine the concept and the design of Message Authentication Code (MAC). I. REVIEW In the previous lectures, we have learned symmetric encryption algorithms and asymmetric encryption algorithms. Now let's review what security goals these algorithms can achieve. Here we are interested in the following security properties: confidentiality, message authentication, and non-repudiation. In particular, message authentication involves two aspects: • Source authentication, which verifies the identity of the source, prevents the acceptance of messages from a fraudulent source. • Data integrity, which protects the data from modification. Let's start with symmetric encryption. As shown in Fig. 1 (a), A sends B a message M encrypted by their shared secret key K. Because a third party is unable to recover the plaintext of the message without the knowledge of K, confidentiality is provided. Now let's examine how encryption mechanism can provide message authentication. Generally, B is assured that the message is from A, because A is the only person (other than B) who is able to generate the ciphertext that can be decrypted using K. Further, if M is fully recovered, B knows none of the bits of M have been altered. However, to achieve this goal B needs to be able to identify the " correct plaintext " from the ones that is decrypted from an altered ciphertext, or the ciphertext generated with a different key. And there are several scenarios: • If M is in ordinary English, then B can recognize the message by reading off it. But this " plaintext " is difficult to be recognized automatically. • If M is in binary code, and can be any arbitrary bit pattern, then there is no way to determine automatically, whether the recovered message is legitimate or not. Lacking of an automatic way to verify the recovered message limits the usage of symmetric encryption as a mechanism for message authentication. Moreover, if a block cipher (such as DES, AES) is used,
منابع مشابه
Lecture 10: Message Authentication Code
In this lecture, we will study message authentication. This lecture is organized as follows. • First we will review the cryptographic algorithms that we have learned so far, and discuss their limitations in protecting data integrity and supporting message authentication. • Then we will examine the concept and the design of Message Authentication Code (MAC). I. REVIEW In the previous lectures, w...
متن کاملLecture 1 : One - Time MACs , ( XOR ) Universal hashing , Weak Keys
In today’s lecture we study one-time message authentication codes (MACs) which are secure in an information-theoretic sense. We will see that, compared to informationtheoretically secure encryption, significantly better parameters can be achieved. We will also study such MACs in the setting of imperfect randomness, i.e. when the secret key is not drawn from the uniform distribution but rather i...
متن کاملRandomness in Cryptography January 10 , 2013 Lecture 1 : One - Time MACs , ( XOR ) Universal hashing , Weak Keys
In today’s lecture we study one-time message authentication codes (MACs) which are secure in an information-theoretic sense. We will see that, compared to informationtheoretically secure encryption, significantly better parameters can be achieved. We will also study such MACs in the setting of imperfect randomness, i.e. when the secret key is not drawn from the uniform distribution but rather i...
متن کاملLecture 2 : Optimality of One - time MACs and Shannon Impossibility
Today we conclude with our study with one-time message authentication codes. In Lecture 1, we defined one-time secure MACs and constructed these MACs using δ − AXU functions. Furthermore, we showed that the security of this construction lost security exponentially with as the min-entropy of the key decreased. We show that the constructions achieved in Lecture 1 were essentially tight. We will d...
متن کاملLecture 2 : Optimality of One - time MACs and Shannon Impossibility
Today we conclude with our study with one-time message authentication codes. In Lecture 1, we defined one-time secure MACs and constructed these MACs using δ − AXU functions. Furthermore, we showed that the security of this construction lost security exponentially with as the min-entropy of the key decreased. We show that the constructions achieved in Lecture 1 were essentially tight. We will d...
متن کامل